Exact FCFS Matching Rates for Two Infinite Multitype Sequences
نویسندگان
چکیده
منابع مشابه
Exact FCFS Matching Rates for Two Infinite Multitype Sequences
Motivated by queues with multi-type servers and multi-type customers, we consider an infinite sequence of items of types C = {c1, . . . , cI}, and another infinite sequence of items of types S = {s1, . . . , sJ}, and a bipartite graph G of allowable matches between the types. We assume that the types of items in the two sequences are i.i.d. with given probability vectors α, β. Matching the two ...
متن کاملEURANDOM PREPRINT SERIES 2010-025 Exact FCFS matching rates for two infinite multi-type sequences
We consider an infinite sequence of items of types C = {c1, . . . , cI}, and another infinite sequence of items of types S = {s1, . . . , sJ}, and a bipartite graph G of allowable matches between the types. Matching the two sequences on a first come first served basis defines a unique infinite matching between the sequences. For (ci, sj) ∈ G we define the matching rate rci,sj as the long term f...
متن کاملFcfs Infinite Bipartite Matching of Servers and Customers
We consider an infinite sequence of customers of types C = {1, 2, . . . , I } and an infinite sequence of servers of types S = {1, 2, . . . , J }, where a server of type j can serve a subset of customer types C(j) and where a customer of type i can be served by a subset of server types S(i). We assume that the types of customers and servers in the infinite sequences are random, independent, and...
متن کاملTwo Dimensional Matching 10.1 Exact Matching
String matching is a basic theoretical problem in computer science, but has been useful in implementating various text editing tasks. The explosion of multimedia requires an appropriate generalization of string matching to higher dimensions. The rst natural generalization is that of seeking the occurrences of a pattern in a text where both pattern and text are rectangles. The last few years saw...
متن کاملEfficient Exact Pattern-Matching in Proteomic Sequences
This paper proposes a novel algorithm for complete exact patternmatching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficient considering larger alphabets. The searching strategy uses large search windows allowing multiple alignments per iteration. A new filtering heuristic, named compatibility rule, contributed decisively to the efficiency improve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2012
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.1110.1027